Constraint Logic Programming for Hedges: A Semantic Reconstruction
نویسندگان
چکیده
We describe the semantics of CLP(H): constraint logic programming over hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms, for hedges, and for function symbols. Constraints involve equations between unranked terms and atoms for regular hedge language membership. We give algebraic semantics of CLP(H) programs, define a sound, terminating, and incomplete constraint solver, and describe some fragments of constraints for which the solver returns a complete set of solutions.
منابع مشابه
CLP(H): Constraint logic programming for hedges
CLP(H) is an instantiation of the general constraint logic programming scheme with the constraint domain of hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms, for hedges, and for function symbols. Constraints involve equations between unranked terms and atoms for regular hedge language membership. We study algebra...
متن کاملJ. Logic Programming 1995:25, 3:191{248 Generalized Semantics Andabstract Interpretation for Constraint Logic Programs
We present a simple and powerful generalized algebraic semantics for constraint logic programs that is parameterized with respect to the underlying constraint system. The idea is to abstract away from standard semantic objects by focusing on the general properties of any|possibly non-standard| semantic deenition. In constraint logic programming, this corresponds to a suitable deenition of the c...
متن کاملSemantic Query Optimization through Abduction and Constraint Handling
The use of integrity constraints to perform Semantic Query Optimization (SQO) in deductive databases can be formalized in a way similar to the use of integrity constraints in Abductive Logic Programming (ALP) and the use of Constraint Handling Rules in Constraint Logic Programming (CLP). Based on this observation and on the similar role played by, respectively, extensional, abducible and constr...
متن کاملBivalent and other solutions of fuzzy relational equations via linguistic hedges
We show that the well-known results regarding solutions of fuzzy relational equations and their systems can easily be generalized to obtain criteria regarding constrained solutions such as solutions which are crisp relations. When the constraint is empty, constrained solutions are ordinary solutions. The generalization is obtained by employing intensifying and relaxing linguistic hedges, concei...
متن کاملGeneralized Semantics and Abstract Interpretation for Constraint Logic Programs
We present a simple and powerful generalized algebraic semantics for constraint logic programs that is parameterized with respect to the underlying constraint system. The idea is to abstract away from standard semantic objects by focusing on the general properties of any|possibly non-standard| semantic deenition. In constraint logic programming, this corresponds to a suitable deenition of the c...
متن کامل